Solving Structured Multifacility Location Problems Efficiently

Duality Results for Extended Multifacility Location Problems

Duality statements are presented for multifacility location problems as suggested by Drezner (1991), where for each given point the sum of weighted distances to all facilities plus set-up costs is determined and the maximal value of these sums is to be minimized. We develop corresponding dual problems for the cases with and without set-up costs and present associated optimality conditions. In t...

Solving Evacuation Problems Efficiently —

Earliest arrival flows capture the essence of evacuation planning. Given a network with capacities and transit times on the arcs, a subset of source nodes with supplies and a sink node, the task is to send the given supplies from the sources to the sink “as quickly as possible”. The latter requirement is made more precise by the earliest arrival property which requires that the total amount of ...

Multifacility Minimax Location Problems via Multi-Composed Optimization

We present a conjugate duality approach for multifacility minimax location problems with geometric constraints, where the underlying space is Fréchet and the distances are measured by gauges of closed convex sets. Besides assigning corresponding conjugate dual problems, we derive necessary and sufficient optimality conditions. Moreover, we introduce a further dual problem with less dual variabl...

Solving Euclidean Distance Multifacility Location Problems Using Conjugate Subgradient and Line-Search Methods

Parallel algorithms for continuous multifacility competitive location problems

We consider a continuous location problem in which a firm wants to set up two or more new facilities in a competitive environment. Both the locations and the qualities of the new facilities are to be found so as to maximize the profit obtained by the firm. This hard-to-solve global optimization problem has been addressed in [38] using several heuristic approaches. Through a comprehensive comput...